Grammar Checking with Dependency Parsing: A Possible Extension for LanguageTool
نویسنده
چکیده
This paper describes a possible extension for a well-known open source grammar checking software LanguageTool. The proposed extension allows the developers to write grammatical rules that rely on natural language parser-supplied dependency trees. Such rules are indispensable for the analysis of word-word links in order to handle a variety of grammatical errors, including improper use of articles, incorrect verb government, and wrong word form agreement.
منابع مشابه
An improved joint model: POS tagging and dependency parsing
Dependency parsing is a way of syntactic parsing and a natural language that automatically analyzes the dependency structure of sentences, and the input for each sentence creates a dependency graph. Part-Of-Speech (POS) tagging is a prerequisite for dependency parsing. Generally, dependency parsers do the POS tagging task along with dependency parsing in a pipeline mode. Unfortunately, in pipel...
متن کاملParsing Korean based on Dependency Grammar and GULP
This paper presents a parsing algorithm in Prolog using GULP, based on dependency grammar and unification-based grammar.1 It parses declarative sentences of a free-word-order language, Korean. The dependency grammar accepts free order of the words in a sentence. Unification-based features separate the grammar from the parsing algorithm and also simplify the notation of the grammar. GULP (Graph ...
متن کاملA Case Study In Implementing Dependency-Based Grammars
In creating an English grammar checking software product, we implemented a large-coverage grammar based on the dependency grammar formalism. This implementat ion required some adaptation of current linguistic description to prevent serious overgeneration of parse trees. Here, • we present one particular example, that of preposition stranding and dangling prepositions, where implementing an alte...
متن کاملDependency Grammar Based English Subject-Verb Agreement Evaluation
As a key factor in English grammar checking, subject-verb agreement evaluation plays an important part in assessing translated English texts. In this paper, we propose a hybrid method for subject-verb agreement evaluation on dependency grammars with the processing of phrase syntactic parsing and sentence simplification for subject-verb discovery. Experimental results on patent text show that we...
متن کاملReestimation and Best-First Parsing Algorithm for Probabilistic Dependency Grammars
This paper presents a reesthnation algorithm and a best-first parsing (BFP) algorithm for probabilistic dependency grummars (PDG). The proposed reestimation algorithm is a variation of the inside-outside algorithm adapted to probabilistic dependency grammars. The inside-outside algorithm is a probabilistic parameter reestimation algorithm for phrase structure grammars in Chomsky Normal Form (CN...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Informatica (Slovenia)
دوره 35 شماره
صفحات -
تاریخ انتشار 2011